Dampvm/dac Programming, Tuning and Automatic Parallelization of Irregular Divide-and-conquer Applications in Programming, Tuning and Automatic Parallelization of Irregular Divide-and-conquer Applications in Dampvm/dac
نویسنده
چکیده
This paper presents a new object oriented framework DAMPVM/DAC which is implemented on top of DAMPVM and provides automatic partitioning of irregular divide-andconquer (DAC) applications at runtime. The processes are then mapped dynamically to processors taking into account their speeds and even loads by other user processes. The paper presents the programming interface (API) of the framework, available tuning mechanisms, internal solutions with respect to automatic partitioning and mapping to processors. Finally, specific parameters, optimization techniques and simulation results are shown for a variety of irregular divide-and-conquer applications. The applications include αβ search, recursive Fibonacci,
منابع مشابه
Programming, Tuning and Automatic Parallelization of Irregular Divide-and-Conquer Applications in DAMPVM/DAC
This paper presents a new object oriented framework DAMPVM/DAC which is implemented on top of DAMPVM and provides automatic partitioning of irregular divide-and-conquer (DAC) applications at runtime. The processes are then mapped dynamically to processors taking into account their speeds and even loads by other user processes. The paper presents the programming interface (API) of the framework,...
متن کاملDevelopment and Tuning of Irregular Divide-and-Conquer Applications in DAMPVM/DAC
This work presents implementations and tuning experiences with parallel irregular applications developed using the object oriented framework DAMPVM/DAC. It is implemented on top of DAMPVM and provides automatic partitioning of irregular divide-and-conquer (DAC) applications at runtime and dynamic mapping to processors taking into account their speeds and even loads by other user processes. New ...
متن کاملDynamic Process Partitioning and Migration for Irregular Applications
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels. Efficient parallelization is difficult as it requires dynamic partitioning and mapping of such trees to available processors. Irregular applications can obtain unpredictable intermediate results which then affect cre...
متن کاملDynamic Partitioning of the Divide-and-Conquer Scheme with Migration in PVM Environment
We present a new C++ framework which enables writing of divideand-conquer (DaC) applications very easily which are then automatically parallelized by dynamic partitioning of the DaC tree and process migration. The solution is based on DAMPVM – the extension of PVM. The proposed system handles irregular applications and dynamically adapts the allocation to minimize execution time which is shown ...
متن کاملData Dependence Analysis for the Parallelization of Numerical Tree Codes
Data dependence analysis for automatic parallelization of sequential tree codes is discussed. Hierarchical numerical algorithms often use tree data structures for unbalanced, adaptively and dynamically created trees. Moreover, such codes often do not follow a strict divide and conquer concept, but introduce some geometric neighborhood data dependence in addition to parent-children dependencies....
متن کامل